Exchangeable Random Networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exchangeable Random Networks

We introduce and study a class of exchangeable random graph ensembles. They can be used as statistical null models for empirical networks, and as a tool for theoretical investigations. We provide general theorems that characterize the degree distribution of the ensemble graphs, together with some features that are important for applications, such as subgraph distributions and kernel of the adja...

متن کامل

Exchangeable and partially exchangeable random partitions

Call a random partition of the positive integers partially exchangeable if for each finite sequence of positive integers n l , . . . , nk, the probability that the partition breaks the first nl + . . . § nk integers into k particular classes, of sizes nl . . . . , nk in order of their first elements, has the same value p(na . . . . . nk) for every possible choice of classes subject to the sizes...

متن کامل

Exchangeable random hypergraphs

A hypergraph is a generalization of a graph in which an edge may contain more than two vertices. Hereditary hypergraphs are particularly important because they arise in mathematics as the class of monotone subsets, in statistics as the class of factorial models, in topology as simplicial complexes and in algebra as the free distributive lattice. An exchangeable random hypergraph consists of a p...

متن کامل

Exchangeable random arrays

These notes were written to accompany a sequence of workshop lectures at the Indian Institute of Science, Bangalore in January 2013. My lectures had two purposes. The first was to introduce some of the main ideas of exchangeability theory at a level suitable for graduate students (assuming familiarity with measure-theoretic probability). The second was to show the key rôle exchangeability has p...

متن کامل

Exchangeable random variables

If Equation (1) be satisfied, then all sets S are equally likely under the null hypothesis. To obtain a permutation test that is both unbiased and most powerful, one need only select the set S so that its probability under the alternative >0 is a maximum. This is accomplished in most cases by rejecting the hypothesis for all values of the test statistic that lie in the upper tail of the permuta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Internet Mathematics

سال: 2007

ISSN: 1542-7951,1944-9488

DOI: 10.1080/15427951.2007.10129152